Source Coding for Quasiarithmetic Penalties
نویسندگان
چکیده
منابع مشابه
Source Coding for Campbell’s Penalties
Given a probability vector, Huffman coding finds a corresponding prefix-free binary code that minimizes the mean codeword length. In this paper we explore situations in which the goals are different from those in Huffman coding. We explore a family of penalties (generalized means) proposed by Campbell [8], finding redundancy bounds for a common subfamily. We generalize an efficient algorithm fo...
متن کاملPath Coding Penalties for Directed Acyclic Graphs
We consider supervised learning problems where the features are embedded in a graph, such as gene expressions in a gene network. In this context, it is of much interest to automatically select a subgraph which has a small number of connected components, either to improve the prediction performance, or to obtain better interpretable results. Existing regularization or penalty functions for this ...
متن کاملThe Inequalities for Quasiarithmetic Means
and Applied Analysis 3 ∑n i 1 pi 1. The discrete basic φ-quasiarithmetic mean of points particles xi with coefficients weights pi is a number Mφ px φ−1 ( n ∑
متن کاملExpansion Coding for Channel and Source Coding
A general method of coding over expansion is proposed, which allows one to reduce the highly non-trivial problems of coding over analog channels and compressing analog sources to a set of much simpler subproblems, coding over discrete channels and compressing discrete sources. More specifically, the focus of this paper is on the additive exponential noise (AEN) channel, and lossy compression of...
متن کاملSource-Optimized Clustering for Distributed Source Coding
Motivated by the design of low-complexity distributed quantizers and iterative decoding algorithms that leverage the correlation in the data picked up by a large-scale sensor network, we address the problem of finding correlation preserving clusters. To construct a factor graph describing the statistical dependencies between sensor measurements, we develop a hierarchical clustering algorithm th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2006
ISSN: 0018-9448
DOI: 10.1109/tit.2006.881728